Correctly Rounded Multiplication by Arbitrary Precision Constants
نویسندگان
چکیده
منابع مشابه
Fast and correctly rounded logarithms in double-precision
This article is a case study in the implementation of a portable, proven and efficient correctly rounded elementary function in double-precision. We describe the methodology used to achieve these goals in the crlibm library. There are two novel aspects to this approach. The first is the proof framework, and in general the techniques used to balance performance and provability. The second is the...
متن کاملTowards Correctly Rounded Transcendentals
The Table Maker’s Dilemma is the problem of always getting correctly rounded results when computing the elementary functions. After a brief presentation of this problem, we present new developments that have helped us to solve this problem for the double-precision exponential function in a small domain. These new results show that this problem can be solved, at least for the double-precision fo...
متن کاملMultiplication by Rational Constants
Multiplications by simple rational constants often appear in fixed-point or floating-point application code, for instance in the form of division by an integer constant. The hardware implementation of such operations is of practical interest to FPGA-accelerated computing. It is well known that the binary representation of rational constants is eventually periodic. This article shows how this fe...
متن کاملWhen is FFT multiplication of arbitrary-precision polynomials practical?
It is well recognized in the computer algebra theory and systems communities that the Fast Fourier Transform (FFT) can be used for multiplying polynomials. Theory predicts that it is fast for “large enough” polynomials. Even so, it appears that no major general-purpose computer algebra system uses the FFT as a general default technique for this purpose. Some provide (optional) access to FFT tec...
متن کاملThe abc conjecture and correctly rounded reciprocal square roots
The reciprocal square root calculation = 1= √ x is very common in scienti/c computations. Having a correctly rounded implementation of it is of great importance in producing numerically predictable code among today’s heterogenous computing environment. Existing results suggest that to get the correctly rounded in a 3oating point number system with p signi/cant bits, we may have to compute up to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computers
سال: 2008
ISSN: 0018-9340
DOI: 10.1109/tc.2007.70813